Propositional Independence Conditional independence
نویسندگان
چکیده
Independence – the study of what is relevant to a given problem of reasoning – is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl’s conditional independence, and two more restricted forms of it, called strong conditional independence and perfect conditional independence. Many characterizations and properties of these independence relations are provided. We show them related to many other notions of independence pointed out so far in the literature (mainly formula-variable independence, irrelevance and novelty under various forms, separability, interactivity). We identify the computational complexity of conditional independence and of all these related independence relations.
منابع مشابه
Conditional independence in propositional logic
Independence—the study of what is relevant to a given problem of reasoning—is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl’s conditional independence, and some more restricted forms of it. Many characterizations and properties of these independence relations are provided. We show them related to many ...
متن کاملProbabilistic Logic with Conditional Independence Formulae1
We investigate probabilistic propositional logic as a way of expressing and reasoning about uncertainty. In contrast to Bayesian networks, a logical approach can easily cope with incomplete information like probabilities that are missing or only known to lie in some interval. However, probabilistic propositional logic as described e.g. by Halpern [9], has no way of expressing conditional indepe...
متن کاملProbabilistic Logic with Conditional Independence Formulae
We investigate a probabilistic propositional logic that is an extension of the logic proposed by Fagin et al. [4] with conditional independence formulae. We give an axiomatization which we show to be complete for the kind of inferences allowed by Bayesian networks.
متن کاملSound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
Knowledge about complex events is usually incomplete in practice. Zeros can be utilized to capture such events within probability models. In this article, Geiger and Pearl’s conditional probabilistic independence statements are investigated in the presence of zeros. Random variables can be specified to be zero-free, i.e., to disallow zeros in their domains. Zero-free random variables provide an...
متن کاملA Logical Notion of Conditional Independence Properties and Applications
We propose a notion of conditional independence with respect to propositional logic and study some of its key properties We present several equivalent formulations of the proposed notion each oriented towards a speci c application of logical reasoning such as abduction and diagnosis We suggest a frame work for utilizing logical independence computationally by structuring a propositional logic d...
متن کامل